Counting and sampling SCJ small parsimony solutions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The SCJ Small Parsimony Problem for Weighted Gene Adjacencies

Reconstructing ancestral gene orders in a given phylogeny is a classical problem in comparative genomics. Most existing methods compare conserved features in extant genomes in the phylogeny to define potential ancestral gene adjacencies, and either try to reconstruct all ancestral genomes under a global evolutionary parsimony criterion, or, focusing on a single ancestral genome, use a scaffoldi...

متن کامل

On sampling SCJ rearrangement scenarios

The Single Cut or Join (SCJ) operation on genomes, generalizing chromosome evolution by fusions and fissions, is the computationally simplest known model of genome rearrangement. While most genome rearrangement problems are already hard when comparing three genomes, it is possible to compute in polynomial time a most parsimonious SCJ scenario for an arbitrary number of genomes related by a bina...

متن کامل

The SCJ small parsimony problem for weighted gene adjacencies (Extended version)

Reconstructing ancestral gene orders in a given phylogeny is a classical problem in comparative genomics. Most existing methods compare conserved features in extant genomes in the phylogeny to define potential ancestral gene adjacencies, and either try to reconstruct all ancestral genomes under a global evolutionary parsimony criterion, or, focusing on a single ancestral genome, use a scaffoldi...

متن کامل

Counting and Sampling H-Colourings

For counting problems in #P which are “essentially self-reducible”, it is known that sampling and approximate counting are equivalent. However, many problems of interest do not have such a structure and there is already some evidence that this equivalence does not hold for the whole of #P. An intriguing example is the class ofH-colouring problems, which have recently been the subject of much st...

متن کامل

Relationship between Counting and Sampling

This course focuses on Markov chain based algorithms for randomly sampling from probability distributions defined on a large state space. Typically we are interested in generating a sample in time polynomial of the logarithm of the size of the state space. In other words, we want to sample from the distribution after exploring only an exponentially small portion of it. We’ll begin with two clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2014

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2014.07.027